DIB—a distributed implementation of backtracking
نویسندگان
چکیده
منابع مشابه
Distributed Dynamic Backtracking
In the scope of distributed constraint reasoning, the main algorithms presented so far have a feature in common: the addition of links between previously unrelated agents, before or during search. This paper presents a new search procedure for finding a solution in a distributed constraint satisfaction problem. This algorithm makes use of some of the good properties of centralised dynamic backt...
متن کاملBacktracking in Distributed Constraint Networks
The adaptation of software technology to distributed environments will be an important challenge in the next few years. In the scope of constraint reasoning, few works have been published on the adaptation of algorithms searching for a solution in a constraint network to distributed constraint networks. This paper presents a new search procedure for finding a solution in a distributed constrain...
متن کاملConcurrent Dynamic Backtracking for Distributed CSPs
A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent search algorithms are composed of multiple search processes (SPs) that operate concurrently and scan non-intersecting parts of the global search space. Search processes are generated dynamically, started by the initializing agent, and by any number of agents during searc...
متن کاملInterleaved Backtracking in Distributed Constraint Networks
The adaptation of software technology to distributed environments is an important challenge today. In this work we combine parallel and distributed search. By this way we add the potential speed-up of a parallel exploration in the processing of distributed problems. This paper extends DIBT, a distributed search procedure operating in distributed constraint networks [6]. The extension is twofold...
متن کاملIncremental Constraint Propagation for Interleaved Distributed Backtracking
This paper describes a way to integrate established propagation techniques known from monolithic algorithms in the asynchronous distributed tree-based algorithm IDIBT without extending its protocol. It furthermore provides some preliminary experimental results of the integrated algorithms. These results show that propagation can often, especially in very hard problems, reduce the number of requ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Programming Languages and Systems
سال: 1987
ISSN: 0164-0925,1558-4593
DOI: 10.1145/22719.24067